AddIntent: A New Incremental Algorithm for Constructing Concept Lattices
نویسندگان
چکیده
An incremental concept lattice construction algorithm, called AddIntent, is proposed. In experimental comparison, AddIntent outperformed a selection of other published algorithms for most types of contexts and was close to the most efficient algorithm in other cases. The current best estimate for the algorithm’s upper bound complexity to construct a concept lattice L whose context has a set of objects G, each of which possesses at most max(|g′|) attributes, is O(|L||G|2max(|g′|)).
منابع مشابه
A Lattice-Free Concept Lattice Update Algorithm based on *CbO
Updating a concept lattice when introducing new objects to input data can be done by any of the so-called incremental algorithms for computing concept lattice of the data. The algorithms use and update the lattice while introducing new objects one by one. The present concept lattice of input data without the new objects is thus required before the update. In this paper we propose an efficient a...
متن کاملAn incremental algorithm to construct a lattice of set intersections
An incremental algorithm to construct a lattice from a collection of sets is derived, refined, analyzed, and related to a similar previously published algorithm for constructing concept lattices. The lattice constructed by the algorithm is the one obtained by closing the collection of sets with respect to set intersection. The analysis explains the empirical efficiency of the related concept la...
متن کاملBuilding Concept (Galois) Lattices from Parts: Generalizing the Incremental Methods
Formal concept analysis and Galois lattices in general are increasingly used as a framework for the resolution of practical problems from software engineering, knowledge engineering and data mining. Recent applications have put the emphasis on the need for both eecient, scalable and exible algorithms to build the lattice. Such features are sought in the development of incremental algorithms. Ho...
متن کاملDesign of Class Hierarchies Based on Concept (Galois) Lattices
Building and maintaining the class hierarchy has been recognized as an important but one of the most difficult activities of object-oriented design. Concept (or Galois) lattices and variant structures are presented as a framework for dealing with the design and maintenance of class hierarchies. Because the design of class hierarchies is inherently an iterative and incremental process, we design...
متن کاملEfficient Incremental Algorithm for Building Swiftly Concepts Lattices
Efficient tool and platform for several areas, concept lattice are widely used in many fields of research. Dynamic environment requires an incremental algorithm to build formal concepts. It plays an essential role in the application of concept lattice. This paper presents a fast, efficient, incremental algorithm to compute formal concepts. Algorithmic complexity is studied both theoretically (i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004